Declarative Specifications for Pharmaceutical Robotics Systems
نویسندگان
چکیده
منابع مشابه
Writing Declarative Specifications for Clauses
Modern satisfiability (SAT) solvers provide an efficient implementation of classical propositional logic. Their input language, however, is based on the conjunctive normal form (CNF) of propositional formulas. To use SAT solver technology in practice, a user must create the input clauses in one way or another. A typical approach is to write a procedural program that generates formulas on the ba...
متن کاملComponent Specifications for Robotics Integration
Robotics researchers have been unable to capitalize easily on existing software components to speed up their development e orts and maximize their system's capabilities. A component-based approach for building the software for robotics systems can provide reuse and sharing abilities to the research community. The software engineering community has been studying reuse techniques for three decade...
متن کاملDeclarative Specifications of Complex Transactions
While specifications of queries are usually of a declarative nature (since the work of Codd in the early seventies), specifications of transactions are still mainly of an operational and descriptive nature. Especially descriptions of complex transactions (such as cascading deletes) tend to be very operational. Often these descriptions turn out to be nondeterministic as well. A problematic conse...
متن کاملVerification from Declarative Specifications Using Logic Programming
In recent years, the declarative programming philosophy has had a visible impact on new emerging disciplines, such as heterogeneous multi-agent systems and flexible business processes. We address the problem of formal verification for systems specified using declarative languages, focusing in particular on the Business Process Management field. We propose a verification method based on the g-SC...
متن کاملExploiting Functional Dependencies in Declarative Problem Specifications
In this paper we tackle the issue of the automatic recognition of functional dependencies among guessed predicates in constraint problem specifications. Functional dependencies arise frequently in pure declarative specifications, because of the intermediate results that need to be computed in order to express some of the constraints, or due to precise modelling choices, e.g., to provide multipl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: JALA: Journal of the Association for Laboratory Automation
سال: 1998
ISSN: 1535-5535
DOI: 10.1177/221106829800300613